Peckness of Edge Posets

نویسندگان

  • David Hemminger
  • Aaron Landesman
  • Zijian Yao
چکیده

For any graded poset P, we define a new graded poset, E(P ), whose elements are the edges in the Hasse diagram of P. For any group, G, acting on the boolean algebra, Bn, we conjecture that E(Bn/G) is Peck. We prove that the conjecture holds for “common cover transitive” actions. We give some infinite families of common cover transitive actions and show that the common cover transitive actions are closed under direct and semidirect products. We also prove that E(Bn/G) is unimodal and symmetric in the case that G is a cyclic group or dihedral group.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hopf Algebras and Edge-labeled Posets

Given a nite graded poset with labeled Hasse diagram, we construct a quasi-symmetric generating function for chains whose labels have xed descents. This is a common generalization of a generating function for the ag f-vector de-ned by Ehrenborg and of a symmetric function associated to certain edge-labeled posets which arose in the theory of Schubert polynomials. We show this construction gives...

متن کامل

Hopf Algebras and Edge-labeled Posets

Given a finite graded poset with labeled Hasse diagram, we construct a quasi-symmetric generating function for chains whose labels have fixed descents. This is a common generalization of a generating function for the flag f -vector defined by Ehrenborg and of a symmetric function associated to certain edge-labeled posets which arose in the theory of Schubert polynomials. We show this constructi...

متن کامل

A new approach to Macaulay posets

We develop a new approach for establishing the Macaulayness of posets representable as cartesian powers of other posets. This approach is based on a problem of constructing an ideal of maximum rank in a poset. Using the relations between the maximum rank ideal problem and the edge-isoperimetric problem on graphs we demonstrate an application of our approach to specification of all posets with a...

متن کامل

On an equivalence in discrete extremal problems

We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric problem on graphs and the shadow minimization problems on posets. For a long time these problems have been considered quite independently. We present close connections between them. In particular we show that a number o...

متن کامل

A NEW CHARACTERIZATION OF ABSOLUTELY PO-PURE AND ABSOLUTELY PURE S-POSETS

In this paper, we investigate po-purity using finitely presented S-posets, and give some equivalent conditions under which an S-poset is absolutely po-pure. We also introduce strongly finitely presented S-posets to characterize absolutely pure S-posets. Similar to the acts, every finitely presented cyclic S-posets is isomorphic to a factor S-poset of a pomonoid S by a finitely generated right con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Order

دوره 34  شماره 

صفحات  -

تاریخ انتشار 2017